maximum independent set造句
例句與造句
- One example is the " maximum independent set " problem:
- The many challenges of designing distributed parallel algorithms apply in equal to the maximum independent set problem.
- Thus, in graphs of bounded treewidth, the maximum independent set problem may be solved in linear time.
- As such, it is unlikely that there exists an efficient algorithm for finding a maximum independent set of a graph.
- For instance, this method leads to a polynomial-time approximation scheme for the maximum independent set of a 1-planar graph.
- It's difficult to find maximum independent set in a sentence. 用maximum independent set造句挺難的
- Many of the known lower bounds on Ramsey numbers come from examples of circulant graphs that have small maximum cliques and small maximum independent sets.
- A "'maximum independent set "'is an independent set of largest possible size for a given graph " G ".
- Finding a maximum independent set in intersection graphs is still NP-complete, but it is easier to approximate than the general maximum independent set problem.
- Finding a maximum independent set in intersection graphs is still NP-complete, but it is easier to approximate than the general maximum independent set problem.
- Via this result, the minimum vertex cover, maximum independent set, and maximum vertex biclique problems may be solved in polynomial time for bipartite graphs.
- The problem of finding such a set is called the "'maximum independent set problem "'and is an NP-hard optimization problem.
- In a bipartite graph, all nodes that are not in the minimum vertex cover can be included in maximum independent set; see K鰊ig's theorem.
- For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time.
- For the perfect graphs, a number of NP-complete optimization problems ( graph coloring problem, maximum clique problem, and maximum independent set problem ) are polynomially solvable.
- Despite the close relationship between maximum cliques and maximum independent sets in arbitrary graphs, the independent set and clique problems may be very different when restricted to special classes of graphs.
更多例句: 下一頁(yè)